Deterministic top-down tree automata: past, present, and future
نویسندگان
چکیده
In strong contrast to their non-deterministic counterparts, deterministic top-down tree automata received little attention in the scientific literature. The aim of this article is to survey recent and less recent results and stipulate new research directions for top-down deterministic tree automata motivated by the advent of the XML data exchange format. In particular, we survey different ranked and unranked top-down tree automata models and discuss expressiveness, closure properties and the complexity of static analysis problems.
منابع مشابه
Efficient inclusion checking for deterministic tree automata and XML Schemas
We present algorithms for testing language inclusion L(A) ⊆ L(B) between tree automata in time O(|A| · |B|) where B is deterministic (bottom-up or top-down). We extend our algorithms for testing inclusion of automata for unranked trees A in deterministic DTDs or deterministic EDTDs with restrained competition D in time O(|A| · |Σ| · |D|). Previous algorithms were less efficient or less general.
متن کاملResidual Finite Tree Automata
Tree automata based algorithms are essential in many fields in computer science such as verification, specification, program analysis. They become also essential for databases with the development of standards such as XML. In this paper, we define new classes of non deterministic tree automata, namely residual finite tree automata (RFTA). In the bottom-up case, we obtain a new characterization ...
متن کاملDeterministic Top-Down Tree Transducers with Iterated Lookahead
It is known that by iterating the look-ahead tree languages for deterministic topdown tree automata, more and more powerful recognizing devices are obtained. Let DR0 = DR, where DR is the class of all tree languages recognizable by deterministic top-down tree automata, and let, for n 1, DRn be the class of all tree languages recognizable by deterministic top-down tree automata with DRn 1 lookah...
متن کاملDeterministic Automata on Unranked Trees
We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is possible to minimize the number of states efficiently and to obtain a unique canonical representative of the accepted tree language. For top-down deterministic automata it is well known that they are less expressive than the non-det...
متن کاملAutomata on Infinite Objects and Their Applications to Logic and Programming
We introduce various types of w-automata, top-down automata and bottom-up automata on infinite trees. We study the power of deterministic and nondeter-ministic tree automata and prove that deterministic and non-deterministic bottom-up tree automata accept the same intinite tree sets. We establish a relationship between tree automata, Logic programs, recursive program schemes, and the monadic se...
متن کامل